On Skeletons , Diameters and Volumesof Metric PolyhedraAntoine DEZA
نویسندگان
چکیده
We survey and present new geometric and combinatorial properties of some polyhedra with application in combinatorial optimization, for example, the max-cut and multicommodity ow problems. Namely we consider the volume, symmetry group, facets, vertices, face lattice, diameter, adjacency and incidence relations and connectivity of the metric polytope and its relatives. In particular, using its large symmetry group, we completely describe all the 13 orbits which form the 275 840 vertices of the 21-dimensional metric polytope on 7 nodes and their incidence and adjacency relations. The edge connectivity, the i-skeletons and a lifting procedure valid for a large class of vertices of the metric polytope are also given. Finally, we present an ordering of the facets of a polytope, based on their adjacency relations, for the enumeration of its vertices by the double description method.
منابع مشابه
On Skeletons, Diameters and Volumes of Metric Polyhedra
Abst rac t . We survey and present new geometric and combinatorial propertiez of some polyhedra with application in combinatorial optimization, for example, the max-cut and multicommodity flow problems. Namely we consider the volume, symmetry group, facets, vertices, face lattice, diameter, adjacency and incidence relm :ons and connectivity of the metric polytope and its relatives. In partic~da...
متن کاملSkeletons of Some Relatives of the N-cube Skeletons of Some Relatives of the N-cube
We study the skeleton of several polytopes related to the n-cube, the halved n-cube, and the folded n-cube. In particular, the Gale polytope of the n-cube, its dual and the duals of the halved n-cube and the complete bipartite sub-graphs polytope.
متن کاملNote on Half-cube Embeddings
We establish some results on embeddings in half-cube graphs. They are motivated by M. Deza, M. Dutour Sikirić, and S. Shpectorov’s conjecture [1] concerning isometric embeddings of the skeletons of polytope Wythoffians in half-cube graphs.
متن کاملOn simplicial and cubical complexes with short links
We consider closed simplicial and cubical n-complexes in terms of link of their (n−2)faces. Especially, we consider the case, when this link has size 3 or 4, i.e., every (n − 2)face is contained in 3 or 4 n-faces. Such simplicial complexes with short (i.e. of length 3 or 4) links are completely classified by their characteristic partition. We consider also embedding into hypercubes of the skele...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996